Spirolaterals, Complexity from Simplicity
نویسنده
چکیده
This paper investigates spirolaterals for their beauty of form and the unexpected complexity arising from them. From a very simple generative procedure, spirolaterals can be created having great complexity and variation. Using mathematical and computer-based methods, issues of closure, variation, enumeration, and predictictability are discussed. A historical review is also included. The overriding interest in this research is to develop methods and procedures to investigate geometry for the purpose of inspiration for new architectural and sculptural forms. This particular phase will concern the two dimensional representations of spirolaterals.
منابع مشابه
The Art of Spirolaterals
This paper continues an investigation into spirolaterals as geometry to generate artistic forms of unexpected complexity and beauty. This particular phase will concern the two dimensional representations of spirolaterals and its forms based on both same and reversals of turns. Using mathematical and computer-based methods, issues of closure, variation, enumeration, and predictictability are dis...
متن کاملChaos/Complexity Theory and Education
Sciences exist to demonstrate the fundamental order underlying nature. Chaos/complexity theory is a novel and amazing field of scientific inquiry. Notions of our everyday experiences are somehow in connection to the laws of nature through chaos/complexity theory’s concerns with the relationships between simplicity and complexity, between orderliness and randomness (Retrieved from http://www.inc...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملDelayed shape matching benefits from simplicity and symmetry
The aim of this study was to evaluate the influence of complexity and symmetry on shape recognition, by measuring the recognition of unfamiliar shapes (created using Fourier Boundary Descriptors, FBDs) through a delayed matching task. Between complexity levels the shapes differed in the frequency of the FBDs and within complexity levels in their phase. Shapes were calibrated to be physically eq...
متن کامل